Learning Stochastic Finite Automata
نویسندگان
چکیده
Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of these finite state machines. In the setting of identification in the limit with probability one, we prove that stochastic deterministic finite automata cannot be identified from only a polynomial quantity of data. If concerned with approximation results, they become Pac-learnable if the L∞ norm is used. We also investigate queries that are sufficient for the class to be learnable.
منابع مشابه
Spectral Learning from a Single Trajectory under Finite-State Policies
We present spectral methods of moments for learning sequential models from a single trajectory, in stark contrast with the classical literature that assumes the availability of multiple i.i.d. trajectories. Our approach leverages an efficient SVD-based learning algorithm for weighted automata and provides the first rigorous analysis for learning many important models using dependent data. We st...
متن کاملLearning Stochastic Finite Automata for Musical Style Recognition
Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We use them to model musical styles: a same automaton can be used to classify new melodies but also to generate them. Through grammatical inference these automata are learned and new pieces of music can be parsed. We show that this works by proposing promising classification results and discuss ...
متن کاملApplication of Stochastic Learning Automata to Intelligent Vehicle Control
A stochastic automaton can perform a finite number of actions in a random environment. When a specific action is performed, the environment responds by producing an environment output that is stochastically related to the action. This response may be favourable or unfavourable. The aim is to design an automaton that can determine the best action guided by past actions and responses. Using Stoch...
متن کاملA new Evolutionary Reinforcement Scheme for Stochastic Learning Automata
A stochastic automaton can perform a finite number of actions in a random environment. When a specific action is performed, the environment responds by producing an environment output that is stochastically related to the action. The aim is to design an automaton, using an evolutionary reinforcement scheme (the basis of the learning process), that can determine the best action guided by past ac...
متن کاملLearning Classes of Probabilistic Automata
Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of research. We show that PFA are identifiable in the limit with probability one. Multiplicity automata (MA) is another device to represent stochastic languages. We show that a MA may generate a stochastic language that cannot be genera...
متن کامل